Parsing with Neural and Finite Automata Networks: A Graph Grammar Approach
نویسندگان
چکیده
Parsing with finite automata networks implies, in one way, the conversion of a regular expression into a minimal deterministic finite automaton, while parsing with neural networks involves parsing of a natural language sentence. In ‘Parsing with finite automata networks’ finite automata are frequently combined using a set of rules for various operations like union, concatenation, and kleene closure; while in ‘Parsing with neural networks’ an incremental tree is
منابع مشابه
An Experimental Survey on Parsing with Neural and Finite Automata Networks
Parsing is the process of structuring a l inear depiction in accordance with a g iven grammar. The “linear depiction” may be a language sentence, a computer program, a weaving pattern, a sequence of biological strata, a part of music, actions in a ritual performance, in short any linear chain in which the preceding elements in some way confine the next element. Parsing with finite automata netw...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملSymbolic Priors for RNN-based Semantic Parsing
Seq2seq models based on Recurrent Neural Networks (RNNs) have recently received a lot of attention in the domain of Semantic Parsing for Question Answering. While in principle they can be trained directly on pairs (natural language utterances, logical forms), their performance is limited by the amount of available data. To alleviate this problem, we propose to exploit various sources of prior k...
متن کاملEfficient techniques for parsing with tree automata
Parsing for a wide variety of grammar formalisms can be performed by intersecting finite tree automata. However, naive implementations of parsing by intersection are very inefficient. We present techniques that speed up tree-automata-based parsing, to the point that it becomes practically feasible on realistic data when applied to context-free, TAG, and graph parsing. For graph parsing, we obta...
متن کاملParsing with Lexicalized Probabilistic Recursive Transition Networks
We present a formalization of lexicalized Recursive Transition Networks which we call Automaton-Based Generative Dependency Grammar (gdg). We show how to extract a gdg from a syntactically annotated corpus, present a chart parser for gdg, and discuss different probabilistic models which are directly implemented in the finite automata and do not affect the parser.
متن کامل